Minimum weight Euclidean t -spanner is NP-hard
نویسندگان
چکیده
منابع مشابه
Minimum weight Euclidean t-spanner is NP-hard
Given a set P of points in the plane, an Euclidean t-spanner for P is a geometric graph that preserves the Euclidean distances between every pair of points in P up to a constant factor t. The weight of a geometric graph refers to the total length of its edges. In this paper we show that the problem of deciding whether there exists an Euclidean t-spanner, for a given set of points in the plane, ...
متن کاملComputing a Minimum-Dilation Spanning Tree is NP-hard
Given a set S of n points in the plane, a minimumdilation spanning tree of S is a tree with vertex set S of smallest possible dilation. We show that given a set S of n points and a dilation δ > 1, it is NP-hard to determine whether a spanning tree of S with dilation at most δ exists.
متن کاملThe Minimum Latency Problem Is NP-Hard for Weighted Trees
In the minimum latency problem (MLP) we are given n points v1, . . . , vn and a distance d(vi, vj) between any pair of points. We have to find a tour, starting at v1 and visiting all points, for which the sum of arrival times is minimal. The arrival time at a point vi is the traveled distance from v1 to vi in the tour. The minimum latency problem is MAX-SNP-hard for general metric spaces, but t...
متن کاملMinimum-Dilation Tour (and Path) is NP-hard
We prove that computing a minimum-dilation (Euclidean) Hamilton circuit or path on a given set of points in the plane is NP-hard.
متن کاملMinimum Maximal Matching Is NP-Hard in Regular Bipartite Graphs
Yannakakis and Gavril showed in [10] that the problem of finding a maximal matching of minimum size (MMM for short), also called Minimum Edge Dominating Set, is NP-hard in bipartite graphs of maximum degree 3 or planar graphs of maximum degree 3. Horton and Kilakos extended this result to planar bipartite graphs and planar cubic graphs [6]. Here, we extend the result of Yannakakis and Gavril in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Discrete Algorithms
سال: 2013
ISSN: 1570-8667
DOI: 10.1016/j.jda.2013.06.010